Object-oriented tree traversal with JJForester

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Object-oriented Tree Traversal with JJForester

We want to use the advanced language processing technology available in the ASF+SDF Meta-Environment in combination with general purpose programming languages. In particular, we want to combine the syntax definition formalism SDF and the associated components that support generalized LR parsing, with the objectoriented language Java. To this end, we implemented JJForester, a tool that generates...

متن کامل

Merkle Tree Traversal Revisited

We propose a new algorithm for computing authentication paths in the Merkle signature scheme. Compared to the best algorithm for this task, our algorithm reduces the worst case running time considerably.

متن کامل

Tree-Traversal Orientation Analysis

This paper presents a profiling-based analysis to determine the traversal orientation of link-based tree data structures. Given the very-high memory-hierarchy latencies in modern computers, once the compiler has identified that a pointer-based data structure represents a tree, it would be useful to determine the predominant orientation of traversal for the tree. Optimizing compilers can impleme...

متن کامل

Parsing As Tree Traversal

This paper presents a unified approach to parsing, in which top-down, bot tomup and left-corner parsers m:e related to preorder, postorder and inorder tree traversals. It is shown that the simplest bo t tom-up and left-corner parsers are left recursive and must be converted using an extended Greibach normal form. With further partial execution, the bo t tom-up and left-corner parsers collapse t...

متن کامل

Morris' tree traversal algorithm reconsidered

In 1968, Knuth posed the problem of designing a stack-free, tag-free, non-recursive algorithm that traversed the tree in in-order while leaving it unaltered in the end. Since then, numerous solutions have appeared in the literature. The 1979 algorithm by Morris is one of the most elegant of these solutions. The algorithm is clearly non-recursive, and appears, at first glance, to use neither a s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 2003

ISSN: 0167-6423

DOI: 10.1016/s0167-6423(02)00108-9